Multiple Roots and Approximate GCDs
نویسنده
چکیده
The pejorative manifold was defined by Kahan in 1972. While multiple roots of a polynomial are naturally ill conditioned, we have that: if we know the multiplicities of the roots, then the roots are well conditioned. Consider a polynomial p with k distinct roots zi, the ith root has multiplicity mi, for i = 1, 2, . . . , k. The degree n of p is then the sum of multiplicities: n = m1 +m2 + · · ·+mk. We derive the relationship between the roots and coefficients of p as follows:
منابع مشابه
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed polynomials have an exact GCD of given degree. We present algorithms based on SOS (Sum of Squares) relaxations for solving the involved polynomial or rational function optimization problems with or without constraints.
متن کاملA geometrical approach to finding multivariate approximate LCMs and GCDs
In this article we present a new approach to compute an approximate least common multiple (LCM) and an approximate greatest common divisor (GCD) of two multivariate polynomials. This approach uses the geometrical notion of principal angles whereas the main computational tools are the Implicitly Restarted Arnoldi Method and sparse QR decomposition. Upper and lower bounds are derived for the larg...
متن کاملApproximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
The computation of the Greatest Common Divisor (GCD) of many polynomials is a nongeneric problem. Techniques defining “approximate GCD” solutions have been defined, but the proper definition of the “approximate” GCD, and the way we can measure the strength of the approximation has remained open. This paper uses recent results on the representation of the GCD of many polynomials, in terms of fac...
متن کاملApproximate Polynomial GCD over Integers with Digits-wise Lattice
For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...
متن کاملNumerical Computation of a Polynomial GCD and Extensions
In the rst part of this paper, we deene approximate polynomial gcds (greatest common divisors) and extended gcds provided that approximations to the zeros of the input polynomials are available. We relate our novel deenition to the older and weaker ones, based on perturbation of the coeecients of the input polynomials, we demonstrate some deeciency of the latter deenitions (which our deenition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014